Factorization, diagonal separation, and disconnectedness
نویسندگان
چکیده
منابع مشابه
Computing connectedness: disconnectedness and discreteness
We consider finite point-set approximations of a manifold or fractal with the goal of determining topological properties of the underlying set. We use the minimal spanning tree of the finite set of points to compute the number and size of its -connected components. By extrapolating the limiting behavior of these quantities as → 0 we can say whether the underlying set appears to be connected, to...
متن کاملFactorization of Block Triangular Matrix Functions with Off-diagonal Binomials
Factorizations of Wiener–Hopf type are considered in the abstract framework of Wiener algebras of matrix-valued functions on connected compact abelian groups, with a non-archimedean linear order on the dual group. A criterion for factorizability is established for 2 × 2 block triangular matrix functions with elementary functions on the main diagonal and a binomial expression in the off-diagonal...
متن کاملLayered nonnegative matrix factorization for speech separation
This paper proposes a layered nonnegative matrix factorization (L-NMF) algorithm for speech separation. The standard NMF method extracts parts-based bases out of nonnegative training data and is often used to separate mixed spectrograms. The proposed L-NMF algorithm comprises of several layers of standard NMF blocks. During training, each layer of the L-NMF is initialized separately and then fi...
متن کاملDiagonal arguments and fixed points
A universal schema for diagonalization was popularized by N.S. Yanofsky (2003), based on a pioneering work of F.W. Lawvere (1969), in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function. It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema. Here, we fi...
متن کاملConnectedness and Disconnectedness: a Different Perspective
A factorization of a Galois connection investigated earlier is used to give a definition of a connectedness-disconnectedness Galois connection that is free of the notion of constant morphism. A new notion of N -fixed morphism with respect to a classN of monomorphisms is presented. This is used to characterize the connectedness-disconnectedness Galois connection in the case that N is closed unde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 1992
ISSN: 0166-8641
DOI: 10.1016/0166-8641(92)90064-7